Discriminative Training of the Scanning N-Tuple Classifier
نویسنده
چکیده
The Scanning N-Tuple classifier (SNT) was introduced by Lucas and Amiri [1, 2] as an efficient and accurate classifier for chaincoded hand-written digits. The SNT operates as speeds of tens of thousands of sequences per second, during both the training and the recognition phases. The main contribution of this paper is to present a new discriminative training rule for the SNT. Two versions of the rule are provided, based on minimizing the mean-squared error and the cross-entropy, respectively. The discriminative training rule offers improved accuracy at the cost of slower training time, since the training is now iterative instead of single pass. The cross-entropy trained SNT offers the best results, with an error rate of 2.5% on sequences derived from the MNIST test set.
منابع مشابه
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and observable variables. Predicting labels as MAP assignments of a Random Markov Field is a particular example of the max-sum classifier. Learning parameters of the max-sum classifier is a challenging problem because even comp...
متن کاملMLIFT: Enhancing Multi-label Classifier with Ensemble Feature Selection
Multi-label classification has gained significant attention during recent years, due to the increasing number of modern applications associated with multi-label data. Despite its short life, different approaches have been presented to solve the task of multi-label classification. LIFT is a multi-label classifier which utilizes a new strategy to multi-label learning by leveraging label-specific ...
متن کاملGrey Scale N Tuple Processing
This paper describes a generalisation of the binary N tuple technique originally described by Bledsoe and Browning (1). The binary N tuple technique has commonly been used for the classification (2) and pre-processing (3) of binary images. The extension to the method described here allows grey level images of objects to be classified using the N tuple method without first having to convert the ...
متن کاملDiscriminative training of n-gram classifiers for speech and text routing
We present a method for conditional maximum likelihood estimation of N-gram models used for text or speech utterance classification. The method employs a well known technique relying on a generalization of the Baum-Eagon inequality from polynomials to rational functions. The best performance is achieved for the 1-gram classifier where conditional maximum likelihood training reduces the class er...
متن کاملDiscriminative Training of N-gram Classifi
We present a method for conditional maximum likelihood estimation of N-gram models used for text or speech utterance classification. The method employs a well known technique relying on a generalization of the Baum-Eagon inequality from polynomials to rational functions. The best performance is achieved for the 1-gram classifier where conditional maximum likelihood training reduces the class er...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003